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 17, 2026 01:00Andrew EpsteinAndrew EpsteinScore: 3,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:003,43137,210,26927,334,0001,146,0002,113,536
2Sep 17, 2026 01:003,44337,357,42427,478,0001,107,0002,113,536
3Sep 17, 2026 01:003,44537,375,42927,479,0001,118,0002,113,536
4Sep 17, 2026 01:003,46437,544,57327,645,0001,111,0002,113,536
5Sep 17, 2026 01:003,53338,065,64328,210,0001,122,0002,113,536
6Sep 17, 2026 01:003,55338,214,41828,368,0001,128,0002,113,536
7Sep 17, 2026 01:003,61039,235,94828,835,0001,130,0002,113,536
8Sep 17, 2026 01:003,62338,796,99728,950,0001,124,0002,113,536
9Sep 17, 2026 01:003,62638,861,70228,985,0001,114,0002,113,536