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 04:10Tejas G.Tejas G.Score: 15,655Success
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 04:1015,575149,382,746128,274,0001,002,0002,281,472
2Nov 4, 2025 04:1015,588155,060,798128,382,0001,002,0002,285,568
3Nov 4, 2025 04:1015,605157,032,908128,521,0001,004,0002,523,136
4Nov 4, 2025 04:1015,644160,190,503127,845,0001,997,0002,285,568
5Nov 4, 2025 04:1015,655159,362,945127,940,0001,999,0002,285,568
6Nov 4, 2025 04:1015,663152,928,483129,004,0001,000,0002,265,088
7Nov 4, 2025 04:1015,669155,323,357128,052,0002,000,0002,285,568
8Nov 4, 2025 04:1015,673158,170,978128,082,0002,001,0002,285,568
9Nov 4, 2025 04:1015,692153,283,809128,239,0002,003,0002,519,040