Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 13, 2026 05:02e1011e1011Score: 57,971Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 05:0257,819491,143,389421,265,00058,633,0002,113,536
2Oct 13, 2026 05:0257,842490,697,801422,494,00057,595,0002,113,536
3Oct 13, 2026 05:0257,894491,147,461421,510,00059,015,0002,113,536
4Oct 13, 2026 05:0257,955512,671,873422,740,00058,290,0002,113,536
5Oct 13, 2026 05:0257,971503,202,696422,659,00058,505,0002,113,536
6Oct 13, 2026 05:0257,990501,819,859422,568,00058,750,0002,113,536
7Oct 13, 2026 05:0258,046502,903,259421,915,00059,868,0002,113,536
8Oct 13, 2026 05:0258,141505,541,984422,292,00060,285,0002,113,536
9Oct 13, 2026 05:0258,184507,017,261422,230,00060,704,0002,113,536