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 02:51CheckHarryCheckHarryScore: 4,215Success
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 02:534,18545,847,32533,558,0001,182,0002,113,536
2Sep 6, 2026 02:534,19344,685,59233,630,0001,172,0002,113,536
3Sep 6, 2026 02:534,19744,727,92033,829,0001,007,0002,113,536
4Sep 6, 2026 02:534,21044,859,33933,932,0001,013,0002,113,536
5Sep 6, 2026 02:534,21544,839,08333,979,0001,007,0002,113,536
6Sep 6, 2026 02:534,22244,868,86533,881,0001,169,0002,113,536
7Sep 6, 2026 02:534,22344,943,90733,933,0001,120,0002,113,536
8Sep 6, 2026 02:534,31845,636,53934,681,0001,165,0002,113,536
9Sep 6, 2026 02:534,35546,006,52235,032,0001,122,0002,113,536