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 27, 2026 00:22Victor MerckléVictor MerckléScore: 4,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 00:224,33544,519,72934,841,0001,143,0002,117,632stderr
2Aug 27, 2026 00:224,33544,366,84434,847,0001,141,0002,117,632stderr
3Aug 27, 2026 00:224,33544,339,88134,838,0001,145,0002,117,632stderr
4Aug 27, 2026 00:224,35244,475,79834,955,0001,171,0002,117,632stderr
5Aug 27, 2026 00:224,35845,178,44735,052,0001,125,0002,117,632stderr
6Aug 27, 2026 00:224,36144,635,14335,071,0001,130,0002,117,632stderr
7Aug 27, 2026 00:224,37144,711,59335,138,0001,149,0002,117,632stderr
8Aug 27, 2026 00:224,43145,132,78735,699,0001,083,0002,117,632stderr
9Aug 27, 2026 00:224,60047,178,97537,120,0001,067,0002,117,632stderr