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 21, 2026 18:22Daniel MastalerzDaniel MastalerzScore: 5,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:225,68470,921,93543,160,0004,014,0002,310,144
2Feb 21, 2026 18:225,68770,815,19743,189,0004,017,0002,273,280
3Feb 21, 2026 18:225,70669,819,16545,347,0002,015,0002,359,296
4Feb 21, 2026 18:225,77977,387,78544,966,0002,997,0002,318,336
5Feb 21, 2026 18:225,78072,528,01643,976,0003,997,0002,260,992
6Feb 21, 2026 18:225,78470,689,29544,010,0004,000,0002,318,336