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 9, 2025 01:28izotoffizotoffScore: 67,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 01:5067,973586,751,887562,173,0002,000,0002,318,336
2Nov 9, 2025 01:5067,976588,815,459562,200,0002,000,0002,318,336
3Nov 9, 2025 01:2867,979590,848,072563,224,0001,000,0002,318,336
4Nov 9, 2025 01:2867,980586,457,902562,236,0002,000,0002,322,432
5Nov 9, 2025 01:5067,980589,852,875563,236,0001,000,0002,424,832
6Nov 9, 2025 01:2867,989588,731,460563,310,0001,000,0002,433,024