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 27, 2026 05:40Victor MerckléVictor MerckléScore: 4,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:404,26343,743,41934,308,0001,076,0002,117,632stderr
2Aug 27, 2026 05:404,28943,901,72134,507,0001,099,0002,117,632stderr
3Aug 27, 2026 05:404,29543,991,02234,540,0001,115,0002,117,632stderr
4Aug 27, 2026 05:404,32044,209,75634,753,0001,111,0002,117,632stderr
5Aug 27, 2026 05:404,34944,444,91434,996,0001,102,0002,117,632stderr
6Aug 27, 2026 05:404,35244,517,70635,001,0001,121,0002,117,632stderr
7Aug 27, 2026 05:404,37944,630,78435,266,0001,082,0002,117,632stderr
8Aug 27, 2026 05:404,38044,809,80635,257,0001,098,0002,117,632stderr
9Aug 27, 2026 05:404,41345,519,77435,548,0001,082,0002,117,632stderr