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 8, 2026 06:19Brian ChewBrian ChewScore: 66,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 06:1966,735577,064,862492,915,00060,989,0002,260,992
2Feb 8, 2026 06:1966,775579,410,617494,209,00060,025,0002,273,280
3Feb 8, 2026 06:1966,816585,360,234492,622,00061,952,0002,277,376
4Feb 8, 2026 06:1966,817583,831,536493,625,00060,953,0002,277,376
5Feb 8, 2026 06:1966,819586,799,882494,640,00059,956,0002,400,256
6Feb 8, 2026 06:1966,830577,099,586495,725,00058,967,0002,277,376
7Feb 8, 2026 06:1966,934583,164,912495,601,00059,951,0002,400,256
8Feb 8, 2026 06:1966,958581,921,455497,777,00057,974,0002,277,376
9Feb 8, 2026 06:1967,020580,684,801495,240,00061,029,0002,502,656