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 listMay 17, 2026 13:53Victor MerckléVictor MerckléScore: 7,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:597,39268,572,86960,276,0001,080,0002,113,536
2May 17, 2026 13:597,39369,212,74760,286,0001,081,0002,113,536
3May 17, 2026 13:597,39768,650,37460,315,0001,088,0002,113,536
4May 17, 2026 13:597,40770,437,55560,388,0001,098,0002,113,536
5May 17, 2026 13:597,42070,572,84360,476,0001,110,0002,113,536
6May 17, 2026 13:597,43168,926,94260,580,0001,101,0002,113,536
7May 17, 2026 13:597,45070,671,35260,738,0001,103,0002,113,536
8May 17, 2026 13:597,45170,805,43760,746,0001,099,0002,113,536
9May 17, 2026 13:597,54371,038,38661,535,0001,075,0002,113,536