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 listSep 17, 2026 00:05Andrew EpsteinAndrew EpsteinScore: 198,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:06198,3731,656,806,1931,645,492,0001,007,0002,117,632stderr
2Sep 17, 2026 00:06198,5011,657,806,5881,646,563,0001,003,0002,117,632stderr
3Sep 17, 2026 00:06198,6011,658,713,7441,647,384,0001,005,0002,117,632stderr
4Sep 17, 2026 00:06198,6261,658,902,1401,646,482,0002,114,0002,117,632stderr
5Sep 17, 2026 00:06198,6891,659,535,5101,647,033,0002,088,0002,117,632stderr
6Sep 17, 2026 00:06198,8871,661,077,0491,649,762,0001,004,0002,117,632stderr
7Sep 17, 2026 00:06198,8961,661,100,8641,649,839,0001,002,0002,117,632stderr
8Sep 17, 2026 00:06199,0421,662,214,1541,651,039,0001,012,0002,117,632stderr
9Sep 17, 2026 00:06199,1801,663,704,7621,651,163,0002,032,0002,117,632stderr