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 19, 2026 14:03lolrdor1gamerlolrdor1gamerScore: 36,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 14:0336,660331,757,904303,277,0001,000,0002,383,872
2Feb 19, 2026 14:0336,666326,854,319304,328,00002,383,872
3Feb 19, 2026 14:0336,670331,963,835303,359,0001,001,0002,523,136
4Feb 19, 2026 14:0336,673330,893,793304,386,00002,527,232
5Feb 19, 2026 14:0336,688334,742,391303,514,000998,0002,523,136
6Feb 19, 2026 14:0336,690333,617,205303,528,000998,0002,383,872
7Feb 19, 2026 14:0336,707331,283,512304,666,00002,375,680
8Feb 19, 2026 14:0336,707331,186,361302,669,0001,997,0002,527,232
9Feb 19, 2026 14:0336,738332,723,548303,927,000999,0002,523,136