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 listNov 30, 2025 06:37Jeffrey JianJeffrey JianScore: 71,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 06:3771,356619,092,078592,252,00002,510,848
2Nov 30, 2025 06:3771,396618,542,323590,590,0001,998,0002,514,944
3Nov 30, 2025 06:3771,444618,051,324591,987,000999,0002,502,656
4Nov 30, 2025 06:3771,445616,949,278589,994,0002,999,0002,383,872
5Nov 30, 2025 06:3771,471622,275,965591,210,0002,000,0002,510,848
6Nov 30, 2025 06:3771,473612,530,669592,226,0001,000,0002,392,064
7Nov 30, 2025 06:3771,481618,523,806591,289,0002,000,0002,519,040
8Nov 30, 2025 06:3771,516624,341,891589,585,0003,997,0002,519,040
9Nov 30, 2025 06:3771,524622,306,421591,655,0001,998,0002,383,872