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 12, 2026 13:43Victor MerckléVictor MerckléScore: 3,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 13:443,74939,556,32630,048,0001,074,0002,117,632stderr
2Aug 12, 2026 13:443,75539,594,62430,093,0001,078,0002,117,632stderr
3Aug 12, 2026 13:443,77340,129,34030,187,0001,129,0002,117,632stderr
4Aug 12, 2026 13:443,77639,765,58430,217,0001,127,0002,117,632stderr
5Aug 12, 2026 13:443,79139,811,58330,379,0001,088,0002,117,632stderr
6Aug 12, 2026 13:443,82141,262,54430,606,0001,113,0002,117,632stderr
7Aug 12, 2026 13:443,82240,175,04030,577,0001,147,0002,117,632stderr
8Aug 12, 2026 13:443,83640,253,66230,766,0001,076,0002,117,632stderr
9Aug 12, 2026 13:443,84040,278,06430,814,0001,063,0002,117,632stderr