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 14, 2026 00:12boop34boop34Score: 19,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 00:1219,840174,340,744163,644,0001,033,0002,113,536
2Jul 14, 2026 00:1219,844174,450,523163,674,0001,035,0002,113,536
3Jul 14, 2026 00:1219,844174,331,137163,666,0001,041,0002,113,536
4Jul 14, 2026 00:1219,848175,028,042163,648,0001,097,0002,113,536
5Jul 14, 2026 00:1219,851174,447,699163,713,0001,053,0002,113,536
6Jul 14, 2026 00:1219,858174,734,630163,711,0001,118,0002,113,536
7Jul 14, 2026 00:1219,872176,012,321163,856,0001,089,0002,113,536
8Jul 14, 2026 00:1219,879175,022,623163,973,0001,025,0002,113,536
9Jul 14, 2026 00:1220,361178,632,750167,958,0001,042,0002,113,536