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 6, 2026 03:05CheckHarryCheckHarryScore: 3,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:063,83641,734,84530,795,0001,047,0002,113,536
2Sep 6, 2026 03:063,83841,755,81930,835,0001,025,0002,113,536
3Sep 6, 2026 03:063,83941,830,33730,840,0001,028,0002,113,536
4Sep 6, 2026 03:063,84741,823,59730,899,0001,032,0002,113,536
5Sep 6, 2026 03:063,84941,879,25530,887,0001,066,0002,113,536
6Sep 6, 2026 03:063,85141,908,75930,937,0001,032,0002,113,536
7Sep 6, 2026 03:063,85341,807,22030,947,0001,035,0002,113,536
8Sep 6, 2026 03:063,90942,338,36331,392,0001,059,0002,113,536
9Sep 6, 2026 03:063,95442,684,41231,768,0001,058,0002,113,536