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:58Victor MerckléVictor MerckléScore: 3,799Success
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:593,77239,753,15230,223,0001,086,0002,117,632stderr
2Aug 12, 2026 13:593,77740,877,01830,227,0001,126,0002,117,632stderr
3Aug 12, 2026 13:593,78439,893,33030,332,0001,076,0002,117,632stderr
4Aug 12, 2026 13:593,79439,891,31530,429,0001,064,0002,117,632stderr
5Aug 12, 2026 13:593,79939,953,77630,247,0001,289,0002,117,632stderr
6Aug 12, 2026 13:593,81240,077,05030,374,0001,266,0002,117,632stderr
7Aug 12, 2026 13:593,81440,058,78530,587,0001,075,0002,117,632stderr
8Aug 12, 2026 13:593,82240,170,49730,533,0001,193,0002,117,632stderr
9Aug 12, 2026 13:593,92340,927,41731,489,0001,074,0002,117,632stderr