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 19, 2026 20:32Daniel MastalerzDaniel MastalerzScore: 7,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:327,54093,334,35561,569,0001,009,0002,293,760
2Feb 19, 2026 20:327,54895,258,96361,639,0001,010,0002,293,760
3Feb 19, 2026 20:327,57196,587,39261,846,000997,0002,277,376
4Feb 19, 2026 20:327,70488,455,93661,948,0001,998,0002,269,184
5Feb 19, 2026 20:327,70990,219,99061,985,0001,999,0002,289,664
6Feb 19, 2026 20:327,71190,377,29062,000,0002,000,0002,289,664