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 listFeb 24, 2026 18:30Kacper GrzybowskiKacper GrzybowskiScore: 52,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:3052,817464,891,404384,338,00054,047,0002,277,376
2Feb 24, 2026 18:3052,934465,831,898387,309,00052,041,0002,277,376
3Feb 24, 2026 18:3053,046461,829,697382,242,00058,036,0002,277,376