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 20:00Victor MerckléVictor MerckléScore: 4,069Success
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 20:013,99341,505,57132,053,0001,089,0002,117,632stderr
2Aug 24, 2026 20:014,03842,013,76432,348,0001,171,0002,117,632stderr
3Aug 24, 2026 20:014,04241,999,35332,445,0001,106,0002,117,632stderr
4Aug 24, 2026 20:014,05942,305,07332,584,0001,107,0002,117,632stderr
5Aug 24, 2026 20:014,06942,211,55532,698,0001,076,0002,117,632stderr
6Aug 24, 2026 20:014,07742,235,05932,767,0001,073,0002,117,632stderr
7Aug 24, 2026 20:014,07942,274,10232,753,0001,108,0002,117,632stderr
8Aug 24, 2026 20:014,21343,414,02433,920,0001,054,0002,117,632stderr
9Aug 24, 2026 20:014,25543,705,92934,250,0001,072,0002,117,632stderr