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 16:08Victor MerckléVictor MerckléScore: 6,609Success
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 16:096,57462,788,82253,432,0001,139,0002,113,536
2Aug 28, 2026 16:096,59963,117,93553,682,0001,090,0002,113,536
3Aug 28, 2026 16:096,60063,119,84753,699,0001,083,0002,113,536
4Aug 28, 2026 16:096,60863,281,92853,760,0001,094,0002,113,536
5Aug 28, 2026 16:096,60963,245,34753,769,0001,092,0002,113,536
6Aug 28, 2026 16:096,61463,431,63953,812,0001,090,0002,113,536
7Aug 28, 2026 16:096,77564,567,77055,201,0001,034,0002,113,536
8Aug 28, 2026 16:096,84466,538,01455,747,0001,061,0002,113,536
9Aug 28, 2026 16:096,89365,791,80556,185,0001,034,0002,113,536