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 listApr 20, 2026 22:15Josu San MartinJosu San MartinScore: 4,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 22:164,81663,273,14938,978,000999,0002,375,680
2Apr 20, 2026 22:164,83465,165,91238,123,0002,006,0002,375,680
3Apr 20, 2026 22:164,89464,090,62439,611,0001,015,0002,379,776
4Apr 20, 2026 22:164,91864,451,51438,836,0001,991,0002,371,584
5Apr 20, 2026 22:164,94863,514,87639,071,0002,003,0002,371,584
6Apr 20, 2026 22:164,95562,469,50039,122,0002,006,0002,363,392
7Apr 20, 2026 22:165,05560,427,27839,960,0001,998,0002,375,680
8Apr 20, 2026 22:165,06264,373,52640,021,0002,001,0002,367,488
9Apr 20, 2026 22:165,31164,473,98542,079,0002,003,0002,387,968