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 listMay 7, 2026 10:11wnwnScore: 3,449Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:113,37943,292,24326,969,0001,081,0002,482,176
2May 7, 2026 10:113,39242,997,26227,095,0001,064,0002,482,176
3May 7, 2026 10:113,39446,554,73527,115,0001,061,0002,490,368
4May 7, 2026 10:113,40944,938,11927,197,0001,100,0002,486,272
5May 7, 2026 10:113,44942,889,56927,533,0001,095,0002,490,368
6May 7, 2026 10:113,54349,189,98228,314,0001,094,0002,482,176
7May 7, 2026 10:113,55645,365,44028,399,0001,117,0002,490,368
8May 7, 2026 10:113,56247,289,67928,479,0001,086,0002,478,080
9May 7, 2026 10:113,58647,017,00928,629,0001,135,0002,478,080