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 8, 2025 23:33izotoffizotoffScore: 60,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 23:4260,577528,972,955500,790,0001,999,0002,539,520
2Nov 8, 2025 23:4260,582526,842,653500,833,0001,999,0002,543,616
3Nov 8, 2025 23:3360,591532,048,959500,908,0001,999,0002,514,944
4Nov 8, 2025 23:3360,594530,908,715500,930,0001,999,0002,543,616
5Nov 8, 2025 23:3360,601526,895,468501,991,000999,0002,543,616
6Nov 8, 2025 23:4260,617526,149,718501,122,0002,000,0002,281,472