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 listJul 9, 2026 03:01Victor MerckléVictor MerckléScore: 16,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 03:0215,938140,393,584131,168,0001,122,0002,117,632stderr
2Jul 9, 2026 03:0215,967140,616,145131,517,0001,013,0002,117,632stderr
3Jul 9, 2026 03:0216,288143,276,134134,044,0001,147,0002,117,632stderr
4Jul 9, 2026 03:0216,335143,808,141134,438,0001,144,0002,117,632stderr
5Jul 9, 2026 03:0216,355143,917,552134,742,0001,011,0002,117,632stderr
6Jul 9, 2026 03:0216,588145,774,245136,639,0001,048,0002,117,632stderr
7Jul 9, 2026 03:0216,906148,423,477139,218,0001,105,0002,117,632stderr
8Jul 9, 2026 03:0216,981149,991,497139,852,0001,092,0002,117,632stderr
9Jul 9, 2026 03:0216,993149,164,591139,949,0001,099,0002,117,632stderr