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 listJun 27, 2026 00:15Code HintsCode HintsScore: 7,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:157,03866,141,04856,349,0002,067,0002,113,536
2Jun 27, 2026 00:157,07966,264,49956,695,0002,061,0002,113,536
3Jun 27, 2026 00:157,07966,298,77455,704,0003,054,0002,113,536
4Jun 27, 2026 00:157,08166,418,02855,718,0003,060,0002,113,536
5Jun 27, 2026 00:157,08466,478,62656,752,0002,049,0002,113,536
6Jun 27, 2026 00:157,08766,510,08056,779,0002,051,0002,113,536
7Jun 27, 2026 00:157,11166,709,81856,978,0002,049,0002,113,536
8Jun 27, 2026 00:157,19167,251,28356,671,0003,015,0002,113,536
9Jun 27, 2026 00:157,34468,444,97557,895,0003,068,0002,113,536