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 3, 2026 13:19RuszrokRuszrokScore: 29,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 13:1929,102272,175,757240,545,0001,002,0002,277,376
2Feb 3, 2026 13:1929,107277,231,321240,585,0001,002,0002,277,376
3Feb 3, 2026 13:1929,121268,145,970239,709,0001,997,0002,396,160
4Feb 3, 2026 13:1929,122269,713,476241,712,00002,277,376
5Feb 3, 2026 13:1929,123274,077,793240,720,000998,0002,277,376
6Feb 3, 2026 13:1929,123270,702,566240,721,000998,0002,277,376
7Feb 3, 2026 13:1929,124269,849,898241,728,00002,392,064
8Feb 3, 2026 13:1929,124268,213,014239,729,0001,997,0002,277,376
9Feb 3, 2026 13:1929,134271,106,580239,812,0001,998,0002,277,376