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 9, 2026 18:24TonyTonyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 18:24010,530,356998,00002,117,632expected "53688955928088072 ", got "mode=100600 regular=1 size=524130950 "
2Aug 9, 2026 18:24011,150,8151,018,00002,117,632expected "53690471468110301 ", got "mode=100600 regular=1 size=524134520 "
3Aug 9, 2026 18:24012,391,6541,014,00002,117,632expected "53685759673472646 ", got "mode=100600 regular=1 size=524129168 "