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 listJul 30, 2025 02:42Marco BarboneMarco BarboneScore: 121,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 02:42120,9521,025,339,2361,002,902,000999,0002,265,088
2Jul 30, 2025 02:42121,4891,039,608,7131,007,358,000999,0002,289,664
3Jul 30, 2025 02:42122,2501,042,195,3191,013,677,000999,0002,265,088