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 5, 2026 17:16CheckHarryCheckHarryScore: 4,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 17:224,20244,673,97133,852,0001,029,0002,113,536
2Sep 5, 2026 17:224,20444,800,70233,883,0001,017,0002,113,536
3Sep 5, 2026 17:224,20545,009,45733,891,0001,017,0002,113,536
4Sep 5, 2026 17:224,21444,785,67033,960,0001,017,0002,113,536
5Sep 5, 2026 17:224,21444,811,12533,961,0001,017,0002,113,536
6Sep 5, 2026 17:224,22845,014,10934,079,0001,018,0002,113,536
7Sep 5, 2026 17:224,25445,176,15834,299,0001,016,0002,113,536
8Sep 5, 2026 17:224,28145,387,29634,514,0001,026,0002,113,536
9Sep 5, 2026 17:224,35346,026,43135,119,0001,017,0002,113,536