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 5, 2026 00:07olliecrowolliecrowScore: 7,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:116,96476,472,03755,501,0002,306,0002,420,736
2May 5, 2026 00:116,97877,010,33055,691,0002,232,0002,531,328
3May 5, 2026 00:116,97975,136,52155,638,0002,289,0002,482,176
4May 5, 2026 00:116,99378,607,75755,739,0002,308,0002,461,696
5May 5, 2026 00:117,03376,606,10256,103,0002,273,0002,531,328
6May 5, 2026 00:117,11175,475,69556,945,0002,084,0002,494,464
7May 5, 2026 00:117,14476,048,77057,032,0002,267,0002,523,136
8May 5, 2026 00:117,15076,717,60957,080,0002,270,0002,469,888
9May 5, 2026 00:117,15078,476,92857,046,0002,306,0002,490,368