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:19Tejas G.Tejas G.Score: 7,336Success
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:197,11884,203,81057,076,0002,002,0002,260,992
2Nov 5, 2025 01:197,13883,932,28057,237,0002,008,0002,523,136
3Nov 5, 2025 01:197,21786,388,38857,903,0001,996,0002,260,992
4Nov 5, 2025 01:197,33680,444,37358,889,0001,996,0002,289,664
5Nov 5, 2025 01:197,34384,134,79058,950,0001,998,0002,289,664
6Nov 5, 2025 01:197,35284,867,90759,020,0002,000,0002,289,664