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:11Tejas G.Tejas G.Score: 12,233Success
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:1112,178126,227,57499,079,0002,001,0002,519,040
2Nov 4, 2025 04:1112,192122,830,46999,188,0002,003,0002,265,088
3Nov 4, 2025 04:1112,204126,128,100100,290,0001,002,0002,277,376
4Nov 4, 2025 04:1112,212123,619,607100,356,0001,003,0002,510,848
5Nov 4, 2025 04:1112,233129,988,228100,533,0001,005,0002,510,848
6Nov 4, 2025 04:1112,262129,245,550100,781,000997,0002,285,568
7Nov 4, 2025 04:1112,266125,463,05099,811,0001,996,0002,285,568
8Nov 4, 2025 04:1112,270126,229,160100,840,000998,0002,285,568
9Nov 4, 2025 04:1112,299128,458,689101,084,0001,000,0002,285,568