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 listFeb 10, 2026 16:54Daniel MastalerzDaniel MastalerzScore: 9,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 16:549,588105,700,47070,517,0009,066,0002,359,296
2Feb 10, 2026 16:549,615106,732,59267,833,00011,970,0002,347,008
3Feb 10, 2026 16:549,623106,822,04571,886,0007,987,0002,473,984
4Feb 10, 2026 16:549,731106,900,39469,799,00010,968,0002,363,392
5Feb 10, 2026 16:549,751111,089,68370,943,0009,992,0002,342,912
6Feb 10, 2026 16:549,793102,369,13372,250,0009,031,0002,347,008