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 24, 2026 18:19Kacper GrzybowskiKacper GrzybowskiScore: 63,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:1963,345554,043,970467,788,00057,973,0002,277,376
2Feb 24, 2026 18:1963,353553,855,264467,851,00057,981,0002,277,376
3Feb 24, 2026 18:1963,388552,974,890472,109,00054,012,0002,277,376
4Feb 24, 2026 18:1963,395548,375,605467,156,00059,019,0002,277,376
5Feb 24, 2026 18:1963,409548,813,807469,266,00057,032,0002,277,376
6Feb 24, 2026 18:1963,423551,687,264468,367,00058,045,0002,404,352
7Feb 24, 2026 18:1963,445552,439,240469,641,00056,956,0002,277,376
8Feb 24, 2026 18:1963,477558,069,274468,871,00057,984,0002,277,376
9Feb 24, 2026 18:1963,647553,352,646468,240,00060,030,0002,277,376