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 listJul 28, 2026 19:12boop34boop34Score: 11,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 19:1310,974100,935,32577,554,00013,532,0002,113,536
2Jul 28, 2026 19:1311,028101,380,12977,034,00014,500,00020,480
3Jul 28, 2026 19:1311,156102,541,92177,379,00015,222,00020,480
4Jul 28, 2026 19:1311,163102,528,97277,395,00015,264,0002,113,536
5Jul 28, 2026 19:1311,209102,827,25176,892,00016,148,00020,480
6Jul 28, 2026 19:1311,222103,073,28577,402,00015,743,0002,113,536
7Jul 28, 2026 19:1311,268103,623,20978,223,00015,307,0002,113,536
8Jul 28, 2026 19:1311,454105,053,55977,246,00017,823,00020,480
9Jul 28, 2026 19:1311,528105,602,73080,351,00015,338,0002,113,536