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 24, 2026 19:27Victor MerckléVictor MerckléScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:283,76439,730,14430,072,0001,171,0002,117,632stderr
2Aug 24, 2026 19:283,76839,636,34530,143,0001,134,0002,117,632stderr
3Aug 24, 2026 19:283,77539,668,97430,157,0001,180,0002,117,632stderr
4Aug 24, 2026 19:283,78741,177,52330,205,0001,234,0002,117,632stderr
5Aug 24, 2026 19:283,78839,848,49930,319,0001,128,0002,117,632stderr
6Aug 24, 2026 19:283,80940,027,90430,600,0001,018,0002,117,632stderr
7Aug 24, 2026 19:283,99441,521,39332,092,0001,061,0002,117,632stderr
8Aug 24, 2026 19:283,99441,518,04232,112,0001,045,0002,117,632stderr
9Aug 24, 2026 19:284,02642,409,36632,338,0001,084,0002,117,632stderr