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 3, 2026 22:42Victor MerckléVictor MerckléScore: 5,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:435,35653,689,00743,381,0001,077,0002,117,632stderr
2Sep 3, 2026 22:435,35752,847,37643,393,0001,076,0002,117,632stderr
3Sep 3, 2026 22:435,35852,878,48843,401,0001,073,0002,117,632stderr
4Sep 3, 2026 22:435,35952,905,57943,400,0001,081,0002,117,632stderr
5Sep 3, 2026 22:435,36252,968,51943,411,0001,095,0002,117,632stderr
6Sep 3, 2026 22:435,36252,960,59043,424,0001,087,0002,117,632stderr
7Sep 3, 2026 22:435,37152,981,24243,546,0001,035,0002,117,632stderr
8Sep 3, 2026 22:435,38553,168,91943,572,0001,130,0002,117,632stderr
9Sep 3, 2026 22:435,38853,131,18143,686,0001,039,0002,117,632stderr