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 4, 2026 23:22olliecrowolliecrowScore: 6,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:226,27468,682,33549,024,0003,055,0002,420,736
2May 4, 2026 23:226,27670,934,33548,998,0003,100,0002,379,776
3May 4, 2026 23:226,27966,077,11650,062,0002,058,0002,473,984
4May 4, 2026 23:226,30970,216,90949,307,0003,058,0002,465,792
5May 4, 2026 23:226,32267,389,22050,417,0002,062,0002,494,464
6May 4, 2026 23:226,32472,086,86849,266,0003,230,0002,355,200
7May 4, 2026 23:226,33867,818,96149,570,0003,039,0002,400,256
8May 4, 2026 23:226,38672,292,11049,893,0003,111,0002,416,640
9May 4, 2026 23:226,40568,941,37150,121,0003,043,0002,449,408