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 29, 2026 17:33Victor MerckléVictor MerckléScore: 4,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:354,39544,838,22635,360,0001,126,0002,117,632stderr
2Aug 29, 2026 17:354,41645,025,59135,525,0001,130,0002,117,632stderr
3Aug 29, 2026 17:354,42345,827,17135,450,0001,269,0002,117,632stderr
4Aug 29, 2026 17:354,43145,103,30635,668,0001,111,0002,117,632stderr
5Aug 29, 2026 17:354,43545,195,76535,720,0001,098,0002,117,632stderr
6Aug 29, 2026 17:354,45845,489,03635,884,0001,122,0002,117,632stderr
7Aug 29, 2026 17:354,46046,095,93735,895,0001,124,0002,117,632stderr
8Aug 29, 2026 17:354,49545,712,47436,183,0001,132,0002,117,632stderr
9Aug 29, 2026 17:354,51047,159,13536,300,0001,134,0002,117,632stderr