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 10, 2026 19:20Daniel MastalerzDaniel MastalerzScore: 8,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:208,22897,156,54864,272,0004,017,0002,314,240
2Feb 10, 2026 19:208,24791,693,20265,429,0003,019,0002,326,528
3Feb 10, 2026 19:208,26794,394,17466,597,0002,018,0002,326,528
4Feb 10, 2026 19:208,41693,984,75665,864,0003,991,0002,310,144
5Feb 10, 2026 19:208,43696,177,53967,020,0003,000,0002,322,432
6Feb 10, 2026 19:208,45999,751,55366,201,0004,012,0002,314,240