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 3, 2026 14:23CheckHarryCheckHarryScore: 4,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 14:244,26145,223,14634,354,0001,018,0002,113,536
2Sep 3, 2026 14:244,26545,247,80934,387,0001,017,0002,113,536
3Sep 3, 2026 14:244,26645,291,48234,397,0001,016,0002,113,536
4Sep 3, 2026 14:244,26945,368,68634,419,0001,018,0002,113,536
5Sep 3, 2026 14:244,27145,316,61434,438,0001,018,0002,113,536
6Sep 3, 2026 14:244,28446,448,38734,542,0001,016,0002,113,536
7Sep 3, 2026 14:244,32345,732,83834,851,0001,032,0002,113,536
8Sep 3, 2026 14:244,44646,992,84435,755,0001,154,0002,113,536
9Sep 3, 2026 14:244,44746,683,37135,902,0001,015,0002,113,536