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 7, 2026 15:09Daniel MastalerzDaniel MastalerzScore: 13,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 15:0913,497134,666,526111,029,0001,000,0002,396,160
2Feb 7, 2026 15:0913,512132,316,185111,145,0001,001,0002,408,448
3Feb 7, 2026 15:0913,512143,418,435111,150,0001,001,0002,392,064
4Feb 7, 2026 15:0913,518135,207,833110,195,0002,003,0002,277,376
5Feb 7, 2026 15:0913,541136,057,913111,385,0001,003,0002,277,376
6Feb 7, 2026 15:0913,549134,533,111111,455,0001,004,0002,400,256
7Feb 7, 2026 15:0913,561141,051,784111,554,0001,004,0002,277,376
8Feb 7, 2026 15:0913,577141,161,120110,692,0001,994,0002,396,160
9Feb 7, 2026 15:0913,586143,018,904110,770,0001,995,0002,277,376