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 29, 2026 10:10Victor MerckléVictor MerckléScore: 5,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:115,55554,416,90345,101,0001,008,0002,117,632stderr
2Aug 29, 2026 10:115,55654,477,89245,098,0001,023,0002,117,632stderr
3Aug 29, 2026 10:115,55654,537,74245,115,0001,004,0002,117,632stderr
4Aug 29, 2026 10:115,55754,507,46445,112,0001,014,0002,117,632stderr
5Aug 29, 2026 10:115,55954,540,47245,133,0001,007,0002,117,632stderr
6Aug 29, 2026 10:115,56254,517,44845,160,0001,010,0002,117,632stderr
7Aug 29, 2026 10:115,64555,247,07845,842,0001,018,0002,117,632stderr
8Aug 29, 2026 10:115,65555,287,95245,878,0001,064,0002,117,632stderr
9Aug 29, 2026 10:115,74956,310,65846,696,0001,028,0002,117,632stderr