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 28, 2026 18:42Karthik ReddyKarthik ReddyScore: 4,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 18:424,78950,111,29438,614,0001,139,0002,179,072
2Sep 28, 2026 18:424,79050,169,93538,722,0001,035,0002,158,592
3Sep 28, 2026 18:424,79350,205,59138,630,0001,152,0002,170,880
4Sep 28, 2026 18:424,79350,227,34238,642,0001,143,0002,170,880
5Sep 28, 2026 18:424,79750,187,22437,775,0002,042,0002,179,072
6Sep 28, 2026 18:424,79850,371,08738,777,0001,050,0002,179,072
7Sep 28, 2026 18:424,80550,323,78038,746,0001,137,0002,158,592
8Sep 28, 2026 18:424,81450,357,37238,819,0001,142,0002,170,880
9Sep 28, 2026 18:424,82150,514,42638,980,0001,039,0002,158,592