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 28, 2026 19:17Victor MerckléVictor MerckléScore: 3,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:183,68138,685,94829,333,0001,227,0002,117,632stderr
2Aug 28, 2026 19:183,68538,701,97829,487,0001,105,0002,117,632stderr
3Aug 28, 2026 19:183,68939,644,58629,456,0001,167,0002,117,632stderr
4Aug 28, 2026 19:183,71038,946,57729,660,0001,141,0002,117,632stderr
5Aug 28, 2026 19:183,72639,229,35929,828,0001,101,0002,117,632stderr
6Aug 28, 2026 19:183,75739,513,63830,052,0001,137,0002,117,632stderr
7Aug 28, 2026 19:183,76539,383,10630,096,0001,156,0002,117,632stderr
8Aug 28, 2026 19:183,76839,455,29730,190,0001,091,0002,117,632stderr
9Aug 28, 2026 19:183,90440,580,25031,297,0001,107,0002,117,632stderr