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 listSep 13, 2026 23:31Victor MerckléVictor MerckléScore: 3,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 23:363,52339,022,65628,124,0001,120,0002,117,632stderr
2Sep 13, 2026 23:363,52539,050,67528,120,0001,141,0002,117,632stderr
3Sep 13, 2026 23:363,53239,114,53128,193,0001,127,0002,117,632stderr
4Sep 13, 2026 23:363,53339,005,56828,187,0001,142,0002,117,632stderr
5Sep 13, 2026 23:363,53739,361,26028,240,0001,121,0002,117,632stderr
6Sep 13, 2026 23:363,57240,118,74228,588,0001,066,0002,117,632stderr
7Sep 13, 2026 23:363,57840,027,80828,558,0001,145,0002,117,632stderr
8Sep 13, 2026 23:363,57939,557,76228,559,0001,151,0002,117,632stderr
9Sep 13, 2026 23:363,59039,615,71128,666,0001,137,0002,117,632stderr