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 listSep 8, 2026 13:18Victor MerckléVictor MerckléScore: 16,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 13:2116,800147,950,927137,933,0001,511,00024,576stderr
2Sep 8, 2026 13:2116,852148,402,085138,547,0001,325,00024,576stderr
3Sep 8, 2026 13:2116,875148,547,807138,607,0001,461,0002,117,632stderr
4Sep 8, 2026 13:2116,896148,771,936138,763,0001,480,0002,117,632stderr
5Sep 8, 2026 13:2116,902149,387,533138,759,0001,534,0002,117,632stderr
6Sep 8, 2026 13:2116,938149,028,483139,071,0001,516,00024,576stderr
7Sep 8, 2026 13:2116,968149,949,454139,317,0001,522,00024,576stderr
8Sep 8, 2026 13:2116,996150,145,027138,109,0002,959,0002,117,632stderr
9Sep 8, 2026 13:2117,553161,514,914144,143,0001,553,00024,576stderr