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:44Tejas G.Tejas G.Score: 7,139Success
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:447,11483,713,38657,042,0002,001,0002,281,472
2Nov 5, 2025 01:447,13981,296,56558,250,0001,004,0002,269,184
3Nov 5, 2025 01:447,20288,230,83657,783,0001,992,0002,265,088