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 18, 2026 18:38wnwnScore: 13,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:3813,541139,913,605110,385,0002,007,0002,441,216
2Feb 18, 2026 18:3813,560140,978,254111,544,0001,004,0002,318,336
3Feb 18, 2026 18:3813,566142,060,114110,589,0002,010,0002,363,392
4Feb 18, 2026 18:3813,707144,550,944111,770,0001,995,0002,428,928
5Feb 18, 2026 18:3813,712139,366,587110,812,0002,994,0002,445,312
6Feb 18, 2026 18:3813,766142,716,714112,251,0002,004,0002,383,872