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 11:49Victor MerckléVictor MerckléScore: 22,338Success
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 11:5222,105191,889,577182,345,0001,129,0002,113,536
2Aug 27, 2026 11:5222,202194,154,828183,207,0001,071,0002,113,536
3Aug 27, 2026 11:5222,270193,916,246183,720,0001,127,0002,113,536
4Aug 27, 2026 11:5222,277193,245,784183,804,0001,097,0002,113,536
5Aug 27, 2026 11:5222,338194,527,491184,292,0001,115,0002,113,536
6Aug 27, 2026 11:5222,648196,977,401186,862,0001,118,0002,113,536
7Aug 27, 2026 11:5222,747197,176,136187,680,0001,124,0002,113,536
8Aug 27, 2026 11:5223,013199,484,000189,888,0001,121,0002,113,536
9Aug 27, 2026 11:5223,016200,130,982189,911,0001,124,0002,113,536