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 28, 2026 07:20Shikhar SoniShikhar SoniScore: 12,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:2112,700114,864,159102,006,0003,410,0002,113,536
2Jun 28, 2026 07:2112,742115,770,734102,392,0003,372,0002,113,536
3Jun 28, 2026 07:2112,748115,288,221102,459,0003,351,0002,113,536
4Jun 28, 2026 07:2112,785115,811,763102,755,0003,364,0002,113,536
5Jun 28, 2026 07:2112,803116,965,536102,910,0003,359,0002,113,536
6Jun 28, 2026 07:2112,842116,042,866103,245,0003,348,0002,113,536
7Jun 28, 2026 07:2112,870116,766,994103,488,0003,341,0002,113,536
8Jun 28, 2026 07:2112,877116,763,912103,517,0003,368,0002,113,536
9Jun 28, 2026 07:2113,017117,997,409104,624,0003,419,0002,113,536