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 11, 2026 01:39Victor MerckléVictor MerckléScore: 4,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 01:403,94641,023,88131,551,0001,209,0002,117,632stderr
2Aug 11, 2026 01:403,95842,003,05131,685,0001,171,0002,117,632stderr
3Aug 11, 2026 01:404,01442,490,66732,149,0001,175,0002,117,632stderr
4Aug 11, 2026 01:404,02341,776,12832,287,0001,111,0002,117,632stderr
5Aug 11, 2026 01:404,04341,811,39332,406,0001,158,0002,117,632stderr
6Aug 11, 2026 01:404,04742,604,49032,422,0001,172,0002,117,632stderr
7Aug 11, 2026 01:404,06841,923,17332,601,0001,164,0002,117,632stderr
8Aug 11, 2026 01:404,07342,079,56532,711,0001,095,0002,117,632stderr
9Aug 11, 2026 01:404,20943,275,81333,840,0001,098,0002,117,632stderr