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:56limanjun99limanjun99Score: 4,402Success
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:574,35553,404,19533,873,0002,280,0002,502,656
2May 4, 2026 13:574,37255,160,84334,005,0002,287,0002,486,272
3May 4, 2026 13:574,39252,485,15333,109,0003,348,0002,502,656
4May 4, 2026 13:574,39752,030,01334,201,0002,296,0002,490,368
5May 4, 2026 13:574,40252,185,47233,152,0003,389,0002,510,848
6May 4, 2026 13:574,40952,943,47933,262,0003,335,0002,502,656
7May 4, 2026 13:574,44952,373,75434,657,0002,273,0002,494,464
8May 4, 2026 13:574,47053,059,31333,809,0003,296,0002,498,560
9May 4, 2026 13:574,47855,226,13934,007,0003,163,0002,514,944