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 listMay 1, 2026 09:04limanjun99limanjun99Score: 16,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 09:0516,073156,593,985131,402,0002,006,0002,514,944
2May 1, 2026 09:0516,083153,886,836131,490,0002,007,0002,510,848
3May 1, 2026 09:0516,086150,998,884131,510,0002,007,0002,519,040
4May 1, 2026 09:0516,122155,987,782130,821,0002,995,0002,510,848
5May 1, 2026 09:0516,145153,000,710132,010,0002,000,0002,510,848
6May 1, 2026 09:0516,155152,702,029132,073,0002,016,0002,310,144
7May 1, 2026 09:0516,229150,714,717131,715,0002,993,0002,342,912
8May 1, 2026 09:0516,245150,251,994132,826,0002,012,0002,334,720
9May 1, 2026 09:0516,279156,065,559132,121,0003,002,0002,510,848