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 18, 2025 02:23Elnur RakhmatullinElnur RakhmatullinScore: 38,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 02:2338,785347,841,692318,913,0002,999,0002,269,184
2Sep 18, 2025 02:2338,787347,036,216318,929,0002,999,0002,404,352
3Sep 18, 2025 02:2338,798347,636,532320,026,0002,000,0002,269,184
4Sep 18, 2025 02:2338,803349,310,217322,062,00002,269,184
5Sep 18, 2025 02:2338,809352,567,119320,118,0002,000,0002,269,184
6Sep 18, 2025 02:2338,814344,057,474322,153,00002,383,872
7Sep 18, 2025 02:2338,836351,875,057321,335,0001,001,0002,392,064
8Sep 18, 2025 02:2338,848348,705,717322,438,00002,269,184
9Sep 18, 2025 02:2338,852349,240,191320,472,0001,996,0002,400,256