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 listAug 24, 2026 19:06Victor MerckléVictor MerckléScore: 3,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:073,80140,042,86330,387,0001,164,0002,117,632stderr
2Aug 24, 2026 19:073,83940,264,52330,734,0001,132,0002,117,632stderr
3Aug 24, 2026 19:073,85240,388,27430,906,0001,070,0002,117,632stderr
4Aug 24, 2026 19:073,86540,457,40830,966,0001,114,0002,117,632stderr
5Aug 24, 2026 19:073,86540,524,20130,942,0001,144,0002,117,632stderr
6Aug 24, 2026 19:073,86740,486,33531,028,0001,075,0002,117,632stderr
7Aug 24, 2026 19:073,88840,711,08431,143,0001,130,0002,117,632stderr
8Aug 24, 2026 19:073,89940,778,00831,237,0001,126,0002,117,632stderr
9Aug 24, 2026 19:073,97241,331,40231,872,0001,096,0002,117,632stderr