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 30, 2026 17:29boop34boop34Score: 21,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 17:3021,408187,475,623176,589,0001,100,0002,113,536
2Jul 30, 2026 17:3021,437187,867,587176,736,0001,194,0002,113,536
3Jul 30, 2026 17:3021,440187,830,582176,734,0001,220,0002,113,536
4Jul 30, 2026 17:3021,444187,865,969176,795,0001,193,0002,113,536
5Jul 30, 2026 17:3021,444189,034,590176,985,0001,003,0002,113,536
6Jul 30, 2026 17:3021,457187,958,995177,042,0001,055,0002,113,536
7Jul 30, 2026 17:3021,463188,058,728177,138,0001,008,0002,113,536
8Jul 30, 2026 17:3021,475188,152,160177,161,0001,087,0002,113,536
9Jul 30, 2026 17:3021,516188,354,472177,391,0001,196,0002,113,536