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 listFeb 14, 2026 14:40Juraj ZelmanJuraj ZelmanScore: 28,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 14:4028,087258,043,807232,124,0001,000,0002,375,680
2Feb 14, 2026 14:4028,103256,686,413232,254,0001,001,0002,367,488
3Feb 14, 2026 14:4028,113255,191,447233,338,00002,293,760
4Feb 14, 2026 14:4028,115257,022,228232,351,0001,001,0002,371,584
5Feb 14, 2026 14:4028,124259,588,634232,426,0001,001,0002,293,760
6Feb 14, 2026 14:4028,125259,031,310232,433,0001,001,0002,293,760
7Feb 14, 2026 14:4028,129263,268,396232,465,0001,002,0002,293,760
8Feb 14, 2026 14:4028,134267,146,523232,516,000997,0002,293,760
9Feb 14, 2026 14:4028,436258,790,400234,016,0002,000,0002,359,296