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 16, 2026 18:37Victor MerckléVictor MerckléScore: 23,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 18:3922,850199,405,664188,595,0001,062,0002,117,632stderr
2Sep 16, 2026 18:3922,892199,764,459188,936,0001,068,0002,117,632stderr
3Sep 16, 2026 18:3922,915199,959,859189,130,0001,065,0002,117,632stderr
4Sep 16, 2026 18:3923,021200,669,032190,016,0001,065,0002,117,632stderr
5Sep 16, 2026 18:3923,049201,027,023190,191,0001,117,0002,117,632stderr
6Sep 16, 2026 18:3923,064201,088,347190,369,0001,069,0002,117,632stderr
7Sep 16, 2026 18:3923,067201,930,283190,412,0001,045,0002,117,632stderr
8Sep 16, 2026 18:3923,107201,617,726190,734,0001,055,0002,117,632stderr
9Sep 16, 2026 18:3923,163202,196,062191,209,0001,046,0002,117,632stderr