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 12, 2026 23:59Jarry XiaoJarry XiaoScore: 16,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 00:0016,675148,074,676137,402,0001,007,0002,117,632
2Jul 13, 2026 00:0016,797149,070,500138,414,0001,007,0002,117,632
3Jul 13, 2026 00:0016,943150,390,797139,624,0001,009,0002,117,632
4Jul 13, 2026 00:0016,944150,250,199139,629,0001,007,0002,117,632
5Jul 13, 2026 00:0016,961150,317,425139,774,0001,008,0002,117,632
6Jul 13, 2026 00:0016,967150,439,825139,826,0001,007,0002,117,632
7Jul 13, 2026 00:0016,976150,453,097139,898,0001,007,0002,117,632
8Jul 13, 2026 00:0016,987150,604,756139,986,0001,007,0002,117,632
9Jul 13, 2026 00:0016,988151,041,851139,999,0001,006,0002,117,632