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 listMay 31, 2025 13:53Emanuele BolognesiEmanuele BolognesiScore: 76,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 13:5376,614660,811,116632,897,0002,999,0002,277,376
2May 31, 2025 13:5376,643665,689,118635,138,0001,000,0002,265,088
3May 31, 2025 13:5376,648662,489,162635,175,0001,000,0002,265,088