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 5, 2026 11:20chereshnya123chereshnya123Score: 69,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:2069,344584,751,099519,340,00056,219,0002,113,536
2Jun 5, 2026 11:2069,403585,201,055519,861,00056,189,0002,113,536
3Jun 5, 2026 11:2069,406585,151,157519,890,00056,180,0002,113,536
4Jun 5, 2026 11:2069,426585,367,092519,964,00056,280,0002,113,536
5Jun 5, 2026 11:2069,470585,725,382520,439,00056,163,0002,113,536
6Jun 5, 2026 11:2069,523586,183,767519,759,00057,286,0002,113,536
7Jun 5, 2026 11:2069,546586,261,753520,041,00057,198,0002,113,536
8Jun 5, 2026 11:2069,564586,405,700520,160,00057,228,0002,113,536
9Jun 5, 2026 11:2069,566586,326,388520,223,00057,176,0002,113,536