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 listNov 3, 2026 08:36Andrew EpsteinAndrew EpsteinScore: 3,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 08:373,41837,581,48828,371,000020,480
2Nov 3, 2026 08:373,42639,466,74228,436,000020,480
3Nov 3, 2026 08:373,44137,796,66628,567,000020,480
4Nov 3, 2026 08:373,44838,150,16428,619,000020,480
5Nov 3, 2026 08:373,45137,885,14228,648,000020,480
6Nov 3, 2026 08:373,45437,933,54328,676,000020,480
7Nov 3, 2026 08:373,45937,956,81228,712,000020,480
8Nov 3, 2026 08:373,46137,974,53028,729,000020,480
9Nov 3, 2026 08:373,47038,066,10128,806,000020,480