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 02:58Andrew EpsteinAndrew EpsteinScore: 55,630Success
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 02:5955,438470,655,783457,941,0002,195,0002,121,728stderr
2Sep 17, 2026 02:5955,442470,600,055458,001,0002,173,0002,121,728stderr
3Sep 17, 2026 02:5955,454470,631,312458,109,0002,163,0002,121,728stderr
4Sep 17, 2026 02:5955,620471,998,116459,484,0002,162,0002,121,728stderr
5Sep 17, 2026 02:5955,630472,049,306459,550,0002,180,0002,121,728stderr
6Sep 17, 2026 02:5955,671473,828,854459,892,0002,183,0002,121,728stderr
7Sep 17, 2026 02:5955,692472,574,710460,063,0002,186,0002,121,728stderr
8Sep 17, 2026 02:5955,696472,650,837460,096,0002,186,0002,117,632stderr
9Sep 17, 2026 02:5955,734473,703,021460,401,0002,194,0002,121,728stderr