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 19:27Mikołaj UzarskiMikołaj UzarskiScore: 9,217Success
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 19:279,114105,117,71256,735,00018,911,0002,441,216
2Feb 10, 2026 19:279,115105,735,98158,730,00016,922,0002,392,064
3Feb 10, 2026 19:279,131104,215,86752,851,00022,935,0002,363,392
4Feb 10, 2026 19:279,165101,670,39456,054,00020,019,0002,473,984
5Feb 10, 2026 19:279,217101,256,08461,600,00014,903,0002,379,776
6Feb 10, 2026 19:279,228107,466,92359,685,00016,910,0002,383,872
7Feb 10, 2026 19:279,229108,311,11753,721,00022,881,0002,342,912
8Feb 10, 2026 19:279,260104,168,36963,880,00012,975,0002,314,240
9Feb 10, 2026 19:279,271105,593,50654,964,00021,985,0002,359,296