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 listAug 10, 2026 23:56Victor MerckléVictor MerckléScore: 4,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 23:574,42846,121,17235,636,0001,119,0002,117,632stderr
2Aug 10, 2026 23:574,43045,151,53635,670,0001,101,0002,117,632stderr
3Aug 10, 2026 23:574,43345,207,21335,674,0001,123,0002,117,632stderr
4Aug 10, 2026 23:574,43745,953,70835,715,0001,113,0002,117,632stderr
5Aug 10, 2026 23:574,44345,275,91335,758,0001,126,0002,117,632stderr
6Aug 10, 2026 23:574,45045,834,35635,821,0001,117,0002,117,632stderr
7Aug 10, 2026 23:574,45445,375,58535,859,0001,116,0002,117,632stderr
8Aug 10, 2026 23:574,47445,516,03035,992,0001,150,0002,117,632stderr
9Aug 10, 2026 23:574,54846,155,11336,629,0001,123,0002,117,632stderr