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 listMar 17, 2026 23:02zielajzielajScore: 3,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 23:023,51050,987,60327,123,0002,009,0002,441,216
2Mar 17, 2026 23:013,52052,295,19827,202,0002,014,0002,519,040
3Mar 17, 2026 23:013,52548,451,81027,238,0002,017,0002,428,928
4Mar 17, 2026 23:013,53150,499,03928,301,0001,010,0002,514,944
5Mar 17, 2026 23:023,53652,117,79227,322,0002,023,0002,433,024
6Mar 17, 2026 23:023,55955,327,70328,525,0001,018,0002,445,312