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 25, 2026 06:20wnwnScore: 3,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 06:213,29935,080,67126,376,0001,013,0002,113,536
2Jun 25, 2026 06:213,43236,553,08527,472,0001,016,0002,113,536
3Jun 25, 2026 06:213,44736,488,42927,603,0001,010,0002,113,536
4Jun 25, 2026 06:213,45036,646,66927,624,0001,012,0002,113,536
5Jun 25, 2026 06:213,46036,603,39627,712,0001,012,0002,113,536
6Jun 25, 2026 06:213,46036,601,31427,710,0001,013,0002,113,536
7Jun 25, 2026 06:213,47536,699,08127,796,0001,048,0002,113,536
8Jun 25, 2026 06:213,48936,798,08427,914,0001,045,0002,113,536
9Jun 25, 2026 06:213,51437,166,80228,151,0001,016,0002,113,536