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 12, 2026 11:59Victor MerckléVictor MerckléScore: 3,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 11:593,74940,406,76329,972,0001,151,0002,117,632stderr
2Aug 12, 2026 11:593,75639,561,05530,021,0001,162,0002,117,632stderr
3Aug 12, 2026 11:593,76939,688,99430,171,0001,115,0002,117,632stderr
4Aug 12, 2026 11:593,78940,566,47430,318,0001,137,0002,117,632stderr
5Aug 12, 2026 11:593,79439,889,08330,296,0001,195,0002,117,632stderr
6Aug 12, 2026 11:593,80540,016,79830,507,0001,079,0002,117,632stderr
7Aug 12, 2026 11:593,81039,786,45330,576,0001,053,0002,117,632stderr
8Aug 12, 2026 11:593,87940,568,65831,115,0001,083,0002,117,632stderr
9Aug 12, 2026 11:594,02341,905,23732,300,0001,093,0002,117,632stderr