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 22:07Victor MerckléVictor MerckléScore: 4,130Success
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 22:084,11843,177,58932,999,0001,184,0002,117,632stderr
2Aug 28, 2026 22:084,12242,363,23733,033,0001,185,0002,117,632stderr
3Aug 28, 2026 22:084,12242,400,34233,023,0001,194,0002,117,632stderr
4Aug 28, 2026 22:084,12743,250,65433,089,0001,170,0002,117,632stderr
5Aug 28, 2026 22:084,13042,714,75233,099,0001,182,0002,117,632stderr
6Aug 28, 2026 22:084,14942,951,17733,332,0001,110,0002,117,632stderr
7Aug 28, 2026 22:084,15442,665,61533,341,0001,142,0002,117,632stderr
8Aug 28, 2026 22:084,17042,804,74333,481,0001,137,0002,117,632stderr
9Aug 28, 2026 22:084,18542,891,93133,615,0001,126,0002,117,632stderr