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 4, 2025 09:59Tejas G.Tejas G.Score: 9,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 09:599,492107,621,01876,789,0001,994,0002,289,664
2Nov 4, 2025 09:599,494103,248,55176,807,0001,995,0002,514,944
3Nov 4, 2025 09:599,499107,841,83976,844,0001,995,0002,519,040
4Nov 4, 2025 09:599,758101,911,22278,993,0001,999,0002,510,848
5Nov 4, 2025 09:599,762106,591,88079,027,0002,000,0002,289,664
6Nov 4, 2025 09:599,763104,595,69979,031,0002,000,0002,289,664