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 6, 2026 23:13Victor MerckléVictor MerckléScore: 4,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:144,88348,588,29739,460,0001,070,0002,117,632stderr
2Jul 6, 2026 23:144,88749,057,39039,418,0001,150,0002,117,632stderr
3Jul 6, 2026 23:144,88848,499,05239,557,0001,021,0002,117,632stderr
4Jul 6, 2026 23:144,89348,647,88539,588,0001,030,0002,117,632stderr
5Jul 6, 2026 23:144,89648,477,14339,522,0001,119,0002,117,632stderr
6Jul 6, 2026 23:144,89748,839,46439,493,0001,156,0002,117,632stderr
7Jul 6, 2026 23:144,90248,795,55839,536,0001,155,0002,117,632stderr
8Jul 6, 2026 23:144,90949,085,82339,738,0001,008,0002,117,632stderr
9Jul 6, 2026 23:144,91349,242,01739,762,0001,020,0002,117,632stderr