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 13:53limanjun99limanjun99Score: 4,420Success
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 13:534,37751,359,31433,967,0002,366,0002,502,656
2May 4, 2026 13:534,37854,771,41233,076,0003,267,0002,506,752
3May 4, 2026 13:534,38951,474,36733,125,0003,306,0002,506,752
4May 4, 2026 13:534,40652,549,13833,458,0003,119,0002,502,656
5May 4, 2026 13:534,42053,693,88133,046,0003,646,0002,494,464
6May 4, 2026 13:534,43354,172,41233,160,0003,639,0002,498,560
7May 4, 2026 13:534,43452,501,27733,569,0003,240,0002,490,368
8May 4, 2026 13:534,46855,271,14134,814,0002,272,0002,494,464
9May 4, 2026 13:534,47755,072,37934,869,0002,295,0002,498,560