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 listSep 3, 2026 23:25Victor MerckléVictor MerckléScore: 7,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 23:267,53771,044,93861,507,0001,058,0002,117,632stderr
2Sep 3, 2026 23:267,53971,039,84361,509,0001,065,0002,117,632stderr
3Sep 3, 2026 23:267,55270,992,95361,603,0001,086,0002,117,632stderr
4Sep 3, 2026 23:267,58771,253,77061,849,0001,131,0002,117,632stderr
5Sep 3, 2026 23:267,60071,706,11061,936,0001,146,0002,117,632stderr
6Sep 3, 2026 23:267,60071,524,96961,978,0001,106,0002,117,632stderr
7Sep 3, 2026 23:267,60172,930,76961,993,0001,098,0002,117,632stderr
8Sep 3, 2026 23:267,62371,532,75762,166,0001,110,0002,117,632stderr
9Sep 3, 2026 23:267,62671,815,13062,159,0001,138,0002,117,632stderr