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 26, 2026 02:07sophiasophiaScore: 40,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 02:0739,916356,754,587331,299,00002,273,280
2Feb 26, 2026 02:0739,970360,344,925329,753,0001,998,0002,273,280
3Feb 26, 2026 02:0739,989362,867,003330,911,000999,0002,273,280
4Feb 26, 2026 02:0740,054362,389,234331,447,0001,001,0002,273,280
5Feb 26, 2026 02:0740,081360,684,011331,670,000999,0002,273,280
6Feb 26, 2026 02:0740,085355,367,854330,711,0001,998,0002,273,280
7Feb 26, 2026 02:0740,095358,333,448331,787,000999,0002,392,064
8Feb 26, 2026 02:0740,098358,822,796330,814,0001,998,0002,273,280
9Feb 26, 2026 02:0740,125358,763,303332,039,0001,000,0002,273,280