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 03:11Andrew EpsteinAndrew EpsteinScore: 97,346Success
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 03:1197,195817,051,459805,721,0001,003,0002,117,632stderr
2Sep 17, 2026 03:1197,271817,592,844806,349,0001,001,0002,117,632stderr
3Sep 17, 2026 03:1197,318818,080,997806,740,0001,005,0002,117,632stderr
4Sep 17, 2026 03:1197,328819,555,121806,815,0001,008,0002,117,632stderr
5Sep 17, 2026 03:1197,346818,756,391806,974,0001,002,0002,117,632stderr
6Sep 17, 2026 03:1197,384818,616,780807,290,0001,001,0002,117,632stderr
7Sep 17, 2026 03:1197,400818,978,957807,424,0001,003,0002,117,632stderr
8Sep 17, 2026 03:1197,499819,542,219808,238,0001,004,0002,117,632stderr
9Sep 17, 2026 03:1197,529819,683,258808,485,0001,008,0002,117,632stderr