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 11, 2026 00:39Victor MerckléVictor MerckléScore: 4,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 00:404,04041,967,74732,468,0001,067,0002,117,632stderr
2Aug 11, 2026 00:404,05242,079,20132,461,0001,172,0002,117,632stderr
3Aug 11, 2026 00:404,06042,086,24032,641,0001,062,0002,117,632stderr
4Aug 11, 2026 00:404,06442,082,41632,600,0001,134,0002,117,632stderr
5Aug 11, 2026 00:404,07342,824,47332,675,0001,133,0002,117,632stderr
6Aug 11, 2026 00:404,08742,308,00832,874,0001,056,0002,117,632stderr
7Aug 11, 2026 00:404,09042,372,64432,825,0001,129,0002,117,632stderr
8Aug 11, 2026 00:404,10742,484,84332,973,0001,120,0002,117,632stderr
9Aug 11, 2026 00:404,14642,742,37733,302,0001,113,0002,117,632stderr