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 26, 2026 21:48Daniel MastalerzDaniel MastalerzScore: 5,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 21:485,44869,028,44443,207,0002,009,0002,277,376
2Feb 26, 2026 21:485,45472,887,70543,257,0002,011,0002,281,472
3Feb 26, 2026 21:485,48267,563,73645,497,00002,289,664
4Feb 26, 2026 21:485,56472,718,18644,173,0002,007,0002,506,752
5Feb 26, 2026 21:485,57070,226,44244,221,0002,010,0002,277,376
6Feb 26, 2026 21:485,61371,783,52645,576,0001,012,0002,498,560