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 24, 2024 02:12MatthiasMatthiasScore: 11,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 02:1211,420126,607,60192,788,0001,995,0002,269,184
2Nov 24, 2024 02:1211,420123,523,51192,787,0001,995,0002,289,664
3Nov 24, 2024 02:1211,422122,525,40693,803,000997,0002,269,184
4Nov 24, 2024 02:1211,424125,480,00992,827,0001,996,0002,289,664
5Nov 24, 2024 02:1211,426124,183,60793,839,000998,0002,289,664
6Nov 24, 2024 02:1211,426119,283,04792,839,0001,996,0002,273,280
7Nov 24, 2024 02:1211,433122,346,34492,897,0001,997,0002,289,664
8Nov 24, 2024 02:1211,434120,866,65192,903,0001,997,0002,523,136
9Nov 24, 2024 02:1211,435118,406,17492,909,0001,998,0002,519,040
10Nov 24, 2024 02:1211,437123,012,94492,930,0001,998,0002,289,664
11Nov 24, 2024 02:1211,438121,173,65392,937,0001,998,0002,285,568
12Nov 24, 2024 02:1211,444118,643,99292,988,0001,999,0002,265,088