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 24, 2025 07:41Rashin SergeyRashin SergeyScore: 54,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 07:4154,692482,028,753449,942,0003,999,0002,273,280
2Oct 24, 2025 07:4154,701482,054,613453,018,0001,000,0002,273,280
3Oct 24, 2025 07:4154,710484,367,718452,096,0002,000,0002,273,280
4Oct 24, 2025 07:4154,714479,899,770451,129,0003,000,0002,260,992
5Oct 24, 2025 07:4154,719488,708,725452,165,0002,000,0002,289,664
6Oct 24, 2025 07:4154,721479,682,103451,181,0003,001,0002,273,280
7Oct 24, 2025 07:4154,733478,770,964453,282,0001,000,0002,273,280
8Oct 24, 2025 07:4154,741480,850,552453,354,0001,000,0002,273,280
9Oct 24, 2025 07:4154,796483,529,796451,811,0002,998,0002,269,184