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 9, 2026 20:25Daniel MastalerzDaniel MastalerzScore: 11,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 9, 2026 20:2511,198117,335,85290,949,0001,998,0002,363,392
2Feb 9, 2026 20:2511,245114,726,08992,329,0001,003,0002,351,104
3Feb 9, 2026 20:2511,254115,863,06593,412,00002,277,376
4Feb 9, 2026 20:2511,416125,942,05694,754,00002,273,280
5Feb 9, 2026 20:2511,459119,188,29094,109,0001,001,0002,351,104
6Feb 9, 2026 20:2511,829125,216,75096,178,0002,003,0002,273,280