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 listOct 15, 2026 15:30timothygktimothygkScore: 33,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 15:3133,639289,746,628278,140,0001,067,0002,117,632stderr
2Oct 15, 2026 15:3133,643290,824,902278,166,0001,078,0002,117,632stderr
3Oct 15, 2026 15:3133,644289,851,895278,178,0001,072,0002,117,632stderr
4Oct 15, 2026 15:3133,645290,525,472278,171,0001,089,0002,117,632stderr
5Oct 15, 2026 15:3133,653290,391,478278,247,0001,081,0002,117,632stderr
6Oct 15, 2026 15:3133,891291,968,696280,291,0001,007,0002,117,632stderr
7Oct 15, 2026 15:3134,496296,935,673285,224,0001,098,0002,117,632stderr
8Oct 15, 2026 15:3134,512297,115,396285,423,0001,030,0002,117,632stderr
9Oct 15, 2026 15:3134,518297,264,900285,409,0001,094,0002,117,632stderr