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 18, 2026 11:31wnwnScore: 7,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 11:316,05174,675,86247,209,0003,013,0002,338,816
2Feb 18, 2026 11:316,18874,909,91447,336,0004,028,0002,383,872
3Feb 18, 2026 11:316,22079,177,19046,566,0005,061,0002,453,504
4Feb 18, 2026 11:317,13287,678,82657,193,0002,006,0002,342,912
5Feb 18, 2026 11:317,18687,703,79357,624,0002,021,0002,453,504
6Feb 18, 2026 11:317,20485,129,06056,808,0002,989,0002,482,176