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 1, 2026 09:52limanjun99limanjun99Score: 7,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 09:547,13376,353,20556,201,0003,010,0002,510,848
2May 1, 2026 09:547,15678,534,76757,385,0002,013,0002,506,752
3May 1, 2026 09:547,16271,161,42957,431,0002,015,0002,318,336
4May 1, 2026 09:547,17580,232,09457,540,0002,018,0002,514,944
5May 1, 2026 09:547,27975,979,26458,405,0002,013,0002,314,240
6May 1, 2026 09:547,29876,908,46858,562,0002,019,0002,502,656
7May 1, 2026 09:547,31876,580,71658,721,0002,024,0002,502,656
8May 1, 2026 09:547,32382,066,23757,792,0002,989,0002,510,848
9May 1, 2026 09:547,33279,855,05757,866,0002,993,0002,510,848