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 2, 2026 12:38Victor MerckléVictor MerckléScore: 4,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:394,17342,376,49133,502,0001,137,0002,117,632stderr
2Jul 2, 2026 12:394,17742,513,74233,582,0001,093,0002,117,632stderr
3Jul 2, 2026 12:394,17942,409,93333,568,0001,123,0002,117,632stderr
4Jul 2, 2026 12:394,17942,498,18633,590,0001,101,0002,117,632stderr
5Jul 2, 2026 12:394,18442,557,46333,679,0001,053,0002,117,632stderr
6Jul 2, 2026 12:394,19042,777,11733,775,0001,007,0002,117,632stderr
7Jul 2, 2026 12:394,20342,635,67933,869,0001,021,0002,117,632stderr
8Jul 2, 2026 12:394,24143,061,47634,126,0001,080,0002,117,632stderr
9Jul 2, 2026 12:394,25343,030,74334,202,0001,106,0002,117,632stderr