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 26, 2026 22:20Victor MerckléVictor MerckléScore: 4,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:204,73147,618,90737,565,0001,704,0002,121,728stderr
2Aug 26, 2026 22:204,75148,477,00037,687,0001,752,0002,121,728stderr
3Aug 26, 2026 22:204,79848,196,22638,094,0001,734,0002,121,728stderr
4Aug 26, 2026 22:204,81048,268,11138,217,0001,713,0002,121,728stderr
5Aug 26, 2026 22:204,81848,314,60338,271,0001,721,0002,121,728stderr
6Aug 26, 2026 22:204,82348,287,22038,331,0001,708,0002,121,728stderr
7Aug 26, 2026 22:204,82448,401,30238,333,0001,710,0002,121,728stderr
8Aug 26, 2026 22:204,83648,448,75738,443,0001,702,0002,121,728stderr
9Aug 26, 2026 22:205,09850,677,32940,610,0001,704,0002,121,728stderr