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 5, 2025 01:36Tejas G.Tejas G.Score: 8,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 01:367,95289,005,79764,002,0002,000,0002,519,040
2Nov 5, 2025 01:367,96188,277,62564,073,0002,002,0002,531,328
3Nov 5, 2025 01:367,98785,704,06764,285,0002,008,0002,289,664
4Nov 5, 2025 01:368,13794,008,63367,535,00002,260,992
5Nov 5, 2025 01:368,16794,527,16465,790,0001,993,0002,289,664
6Nov 5, 2025 01:368,18390,940,93965,920,0001,997,0002,289,664